Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
161	Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:15 Graph coloring NP-complete problems Bipartite graph Parity Graph theory Treewidth Vertex cover Cubic graph Cograph Hadwiger number
162	Lectures on Spectral Graph Theory Fan R. K. Chung Author address: University of Pennsylvania, Philadelphia, Pennsylvania 19104 Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2002-06-02 13:44:51 Algebraic graph theory Graph theory Matrices Expander graph Spectral graph theory Adjacency matrix Eigenvalues and eigenvectors Regular graph Complete bipartite graph Graph Neighbourhood Laplacian matrix
163	On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2014-04-14 14:04:38 NP-complete problems Graph theory Network theory Edsger W. Dijkstra Shortest path problem Maximal independent set Independent set Matching Bipartite graph Degree Graph Line graph
164	Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:11 Network theory NP-complete problems Edsger W. Dijkstra Graph coloring Spanning tree Matching Shortest path problem Logical matrix Treewidth Matrix Minimum spanning tree Clique
165	RAM: Randomized Approximate Graph Mining Based on Hashing Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2008-07-13 12:41:38 NP-complete problems Graph theory Graph Subgraph isomorphism problem
166	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm
167	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem
168	Metric Clustering via Consistent Labeling Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-09-28 14:30:42 Combinatorial optimization Operations research NP-complete problems Approximation algorithms Computational problems Linear programming Minimum k-cut Optimization problem Ear decomposition Decomposition method
169	MCS 441 – Theory of Computation I Spring 2016 Problem Set 5∗ Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-04-18 15:41:22 Complexity classes P versus NP problem NP IP P-complete
170	ESFinal 2007 Answer Question 1 and four (4) of Questions 2-9. You have three (3) hours to complete the test. No calculators or cheat sheets to be used (except the Formula Sheet I’ve provided you with). Make sure Add to Reading List Source URL: www.es.ucsc.edu Language: English - Date: 2008-12-01 15:02:59 Differential equations Matrix theory Linear algebra Heat equation Heat transfer Ordinary differential equations Equation solving Partial differential equation Differential geometry of surfaces Matrix Eigenvalues and eigenvectors Linear differential equation

UPDATE